The Basic Arithmetic of Legislative Decisions
نویسندگان
چکیده
منابع مشابه
The Basic Arithmetic of Legislative Decisions
Despite the huge number of possible seat distributions following a general election in a multiparty parliamentary democracy, there are far fewer classes of seat distribution sharing important strategic features. We define an exclusive and exhaustive partition of the universe of theoretically-possible n-party systems into five basic classes, the understanding of which facilitates more fruitful m...
متن کاملThe Integer Arithmetic of Legislative Dynamics
Every legislature may be defined by a finite integer partition of legislative seats between parties and a winning vote quota defining the minimum coalition size required to pass decisions. In this paper we explore the finite set of integer partitions of legislatures, categorizing all legislatures as one of five basic types. As legislatures approach the partition thresholds between these categor...
متن کاملInnocuous Double Rounding of Basic Arithmetic Operations
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملProvably total functions of Basic Arithmetic
It is shown that all the provably total functions of Basic Arithmetic , a theory introduced by Ruitenburg based on Predicate Basic Calculus, are primitive recursive. Along the proof a new kind of primitive recursive realizability to which is sound, is introduced. This realizability is similar to Kleene’s recursive realizability, except that recursive functions are restricted to primitive recurs...
متن کاملEncoding Basic Arithmetic Operations for SAT-Solvers
In this paper we start an investigation to check the best we can do with SAT encodings for solving two important hard arithmetic problems, integer factorization and discrete logarithm. Given the current success of using SAT encodings for solving problems with linear arithmetic constraints, studying the suitability of SAT for solving non-linear arithmetic problems was a natural step. However, ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Political Science
سال: 2014
ISSN: 0092-5853
DOI: 10.1111/ajps.12111